\documentclass[a4paper,11pt]{article}
\usepackage{algorithm}
\usepackage{algorithmic}

\title{Daily progress report 2}
\author{Hylke Buisman}

\begin{document}
\maketitle

\setlength{\parindent}{0pt}
\setlength{\parskip}{0.3em}

\section{Introduction}
This document serves to report the progress that was made on the thursday and friday of the first week.
This will mainly consist of a small abstract from my Wiki\footnote{http://hbuisman.wetpaint.com/}, which contains more detailed and up to date info on my progress. The next sections present a small logbook and
a short summary of my activities.

\section{Logbook}

\begin{table*}[h]
	\centering
		\begin{tabular}{ccp{3.5in}}
		\textbf{Day} & \textbf{Hours} & \textbf{Activities}\\
		\hline \\
		June 7 & 11 & Worked on Breadth first implementation + implementation consistency rules\\
		June 8 & 8 & Meeting Bert + Adapted algorithm + working out details on paper\\
		\end{tabular}
\end{table*}

\section{Summary}
To prevent that I would spend most time on talking and planning I started
off with the algorithm in breadth-first form. I also implemented the successor
function for the tree. I designed the successor function in such a way, that every successor 
contains dependencies based on only one pair or triple of quantities.
If every step would generate dependencies for all quantity pairs at once, it would be more difficult to guide
search using a heuristic. Besides implementing I also documented the algorithm in pseudo-code. 
Implementing little functions like sign and even more interface
predicates to access GARP3 data took a lot of my time.
On Friday I had a meeting with Bert and Jochem, which was rather fruitful. We discussed an alternative approach for 
the algorithm. As a result of this discussion the algorithm outline changed: not a breadth first 
approach is chosen, but a iterative approach.
I also spent time working out relations and constraints between dependencies.

\end{document}
